منابع مشابه
Majority-rule supertrees.
Most supertree methods proposed to date are essentially ad hoc, rather than designed with particular properties in mind. Although the supertree problem remains difficult, one promising avenue is to develop from better understood consensus methods to the more general supertree setting. Here, we generalize the widely used majority-rule consensus method to the supertree setting. The majority-rule ...
متن کاملProperties of majority-rule supertrees.
Supertree methods assemble many smaller phyloge-netic trees, called input trees, into a larger phylogenetic tree, a supertree, whose taxon set is the union of the taxon sets of the input trees. This synthesis can provide a high-level perspective that is harder to attain from individual trees. A recent example of the use of this approach is the species-level phylogeny of nearly all extant Mammal...
متن کاملRunning head: PROPERTIES OF MAJORITY-RULE SUPERTREES Properties of Majority-Rule Supertrees
2 Supertree methods assemble many smaller phylogenetic trees, called input trees, into a larger phylogenetic tree, a supertree, whose taxon set is the union of the taxon sets of the input trees. This synthesis can provide a high-level perspective that is harder to attain from individual trees. A recent example of the use of this approach is the species-level phylogeny of nearly all extant Mamma...
متن کاملConstructing Large Conservative Supertrees
Generalizations of the strict and loose consensus methods to the supertree setting, recently introduced by McMorris and Wilkinson, are studied. The supertrees these methods produce are conservative in the sense that they only preserve information (in the form of splits) that is supported by at least one the input trees and that is not contradicted by any of the input trees. Alternative, equival...
متن کاملConstructing rooted supertrees using distances.
Suppose that a family of rooted phylogenetic trees Ti with different sets Xi of leaves is given. A supertree for the family is a single rooted tree T whose leaf set is the union of all the Xi, such that the branching information in T corresponds to the branching information in all the trees Ti. This paper proposes a polynomial-time method BUILD-WITH-DISTANCES that makes essential use of distanc...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Algorithms for Molecular Biology
سال: 2010
ISSN: 1748-7188
DOI: 10.1186/1748-7188-5-2